Variance Bounding Markov Chains
نویسندگان
چکیده
We introduce a new property of Markov chains, called variance bounding. We prove that, for reversible chains at least, variance bounding is weaker than, but closely related to, geometric ergodicity. Furthermore, variance bounding is equivalent to the existence of usual central limit theorems for all L functionals. Also, variance bounding (unlike geometric ergodicity) is preserved under the Peskun order. We close with some applications to Metropolis–Hastings algorithms.
منابع مشابه
Variance Bounding Markov Chains 1203 Theorem
We introduce a new property of Markov chains, called variance bounding. We prove that, for reversible chains at least, variance bounding is weaker than, but closely related to, geometric ergodicity. Furthermore, variance bounding is equivalent to the existence of usual central limit theorems for all L2 functionals. Also, variance bounding (unlike geometric ergodicity) is preserved under the Pes...
متن کاملVariance Bounding Markov Chains by Gareth
We introduce a new property of Markov chains, called variance bounding. We prove that, for reversible chains at least, variance bounding is weaker than, but closely related to, geometric ergodicity. Furthermore, variance bounding is equivalent to the existence of usual central limit theorems for all L functionals. Also, variance bounding (unlike geometric ergodicity) is preserved under the Pesk...
متن کاملDiscrepancy estimates for variance bounding Markov chain quasi-Monte Carlo
Markov chain Monte Carlo (MCMC) simulations are modeled as driven by true random numbers. We consider variance bounding Markov chains driven by a deterministic sequence of numbers. The star-discrepancy provides a measure of efficiency of such Markov chain quasi-Monte Carlo methods. We define a pull-back discrepancy of the driver sequence and state a close relation to the star-discrepancy of the...
متن کاملGENERALIZED CLASS C MARKOV CHAINS AND COMPUTATION OF CLOSED-FORM BOUNDING DISTRIBUTIONS Short title: GENERALIZED CLASS C MARKOV CHAINS
In this paper, we first give a characterization of a class of probability transition matrices having closed-form solutions for transient distributions and the steady-state distribution. We propose to apply stochastic comparison approach to construct bounding chains belonging to this class. Therefore bounding chains can be analyzed efficiently through closed-form solutions in order to provide bo...
متن کاملNonasymptotic bounds on the estimation error of MCMC algorithms
We address the problem of upper bounding the mean square error of MCMC estimators. Our analysis is non-asymptotic. We first establish a general result valid for essentially all ergodic Markov chains encountered in Bayesian computation and a possibly unbounded target function f. The bound is sharp in the sense that the leading term is exactly σ as(P, f)/n, where σ 2 as(P, f) is the CLT asymptoti...
متن کامل